package 算法.贪心算法;

import java.util.*;

//https://leetcode-cn.com/problems/minimum-number-of-arrows-to-burst-balloons/
public class 用最少数量的箭引爆气球 {
    public static void main(String[] args) {
        System.out.println(findMinArrowShots(new int[][]{{1,2},{0,1},{2,3},{0,2}}));

    }
    public static int findMinArrowShots(int[][] points) {

        Arrays.sort(points,(e1,e2)->{
            return e1[0] - e2[0];
        });
        List<int[]> poinsl = new ArrayList<>();
        for (int[] point : points) {
            poinsl.add(point);
        }
        //最大数量的左坐标
        int maxP = 0;
        //包含最大数量的左坐标的点
        List<int[]> maxPoins = new ArrayList<>();
        for (int i = 0; i < poinsl.size(); i++) {

        }
        return 1;
    }
}
